A Novel Stochastic Algorithm Using Pythagorean Means for Minimization
نویسندگان
چکیده
منابع مشابه
A Novel Stochastic Algorithm Using Pythagorean Means for Minimization
In this paper, A Novel Stochastic Algorithm using Pythagorean means for minimization of the objective function is described. The algorithm is initially tested with Rastrigin’s function and compared with Genetic algorithm results for the function with the same initial conditions. After this, it is used in tuning the gains of fuzzy PD + I controller for trajectory control of PUMA 560 robot manipu...
متن کاملA stochastic algorithm for function minimization
Focusing on what an optimization problem may comply with, the so-called convergence conditions have been proposed and sequentially a stochastic optimization algorithm named as DSZ algorithm is presented in order to deal with both unconstrained and constrained optimizations. Its principle is discussed in the theoretical model of DSZ algorithm, from which we present a practical model of DSZ algor...
متن کاملA Novel Algorithm for Digital Distance Relaying
Distance relays are used to protect EHV and HV Transmission lines. Over the past decades many algorithms have emerged for digital distance relays. These are based on the calculation of the transmission line impedance from the relaying to fault points. In this paper a novel method for digital distance relaying is proposed. In the method the tracking procedure is implemented. The method uses the ...
متن کاملA Novel Algorithm for Digital Distance Relaying
Distance relays are used to protect EHV and HV Transmission lines. Over the past decades many algorithms have emerged for digital distance relays. These are based on the calculation of the transmission line impedance from the relaying to fault points. In this paper a novel method for digital distance relaying is proposed. In the method the tracking procedure is implemented. The method uses the ...
متن کاملA Hybrid Data Clustering Algorithm Using Modified Krill Herd Algorithm and K-MEANS
Data clustering is the process of partitioning a set of data objects into meaning clusters or groups. Due to the vast usage of clustering algorithms in many fields, a lot of research is still going on to find the best and efficient clustering algorithm. K-means is simple and easy to implement, but it suffers from initialization of cluster center and hence trapped in local optimum. In this paper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Intelligent Control and Automation
سال: 2010
ISSN: 2153-0653,2153-0661
DOI: 10.4236/ica.2010.12009